582 research outputs found

    FTMP data acquisition environment

    Get PDF
    The Fault-Tolerant Multi-Processing (FTMP) test-bed data acquisition environment is described. The performance of two data acquisition devices available in the test environment are estimated and compared. These estimated data rates are used as measures of the devices' capabilities. A new data acquisition device was developed and added to the FTMP environment. This path increases the data rate available by approximately a factor of 8, to 379 KW/S, while simplifying the experiment development process

    Abnormal fault-recovery characteristics of the fault-tolerant multiprocessor uncovered using a new fault-injection methodology

    Get PDF
    An investigation was made in AIRLAB of the fault handling performance of the Fault Tolerant MultiProcessor (FTMP). Fault handling errors detected during fault injection experiments were characterized. In these fault injection experiments, the FTMP disabled a working unit instead of the faulted unit once in every 500 faults, on the average. System design weaknesses allow active faults to exercise a part of the fault management software that handles Byzantine or lying faults. Byzantine faults behave such that the faulted unit points to a working unit as the source of errors. The design's problems involve: (1) the design and interface between the simplex error detection hardware and the error processing software, (2) the functional capabilities of the FTMP system bus, and (3) the communication requirements of a multiprocessor architecture. These weak areas in the FTMP's design increase the probability that, for any hardware fault, a good line replacement unit (LRU) is mistakenly disabled by the fault management software

    In-circuit fault injector user's guide

    Get PDF
    A fault injector system, called an in-circuit injector, was designed and developed to facilitate fault injection experiments performed at NASA-Langley's Avionics Integration Research Lab (AIRLAB). The in-circuit fault injector (ICFI) allows fault injections to be performed on electronic systems without special test features, e.g., sockets. The system supports stuck-at-zero, stuck-at-one, and transient fault models. The ICFI system is interfaced to a VAX-11/750 minicomputer. An interface program has been developed in the VAX. The computer code required to access the interface program is presented. Also presented is the connection procedure to be followed to connect the ICFI system to a circuit under test and the ICFI front panel controls which allow manual control of fault injections

    Superconvergence in Iterated Solutions of Integral Equations

    Get PDF
    In this thesis, we investigate the superconvergence phenomenon of the iterated numerical solutions for the Fredholm integral equations of the second kind as well as a class of nonliner Hammerstein equations. The term superconvergence was first described in the early 70s in connection with the solution of two-point boundary value problems and other related partial differential equations. Superconvergence in this context was understood to mean that the order of convergence of the numerical solutions arising from the Galerkin as well as the collocation method is higher at the knots than we might expect from the numerical solutions that are obtained by applying a class of piecewise polynomials as approximating functions. The type of superconvergence that we investigate in this thesis is different. We are interested in finding out whether or not we obtain an enhancement in the global rate of convergence when the numerical solutions are iterated through integral operators. A general operator approximation scheme for the second kind linear equation is described that can be used to explain some of the existing superconvergence results. Moreover, a corollary to the general approximation scheme will be given which can be used to establish the superconvergence of the iterated degenerate kernel method for the Fredholm equations of the second kind. We review the iterated Galerkin method for Hammerstein equations and discuss the iterated degenerate kernel method for the Fredholm equations of the second kind. We review the iterated Galerkin method for Hammerstein equations and discuss the iterated degenerate kernel method for Hammerstein and weakly singular Hammerstein equations and its corresponding superconvergence phenomena for the iterated solutions. The type of regularities that the solution of weakly singular Hammerstein equations possess is investigated. Subsequently, we establish the singularity preserving Galerkin method for Hammerstein equations. Finally, the superconvergence results for the iterated solutions corresponding to this method will be described

    Superconvergence of the Iterated Collocation Methods for Hammerstein Equations

    Get PDF
    In this paper, we analyse the iterated collocation method for Hammerstein equations with smooth and weakly singular kernels. The paper expands the study which began in [16] concerning the superconvergence of the iterated Galerkin method for Hammerstein equations. We obtain in this paper a similar superconvergence result for the iterated collocation method for Hammerstein equations. We also discuss the discrete collocation method for weakly singular Hammerstein equations. Some discrete collocation methods for Hammerstein equations with smooth kernels were given previously in [3, 18]

    Functional Equivalence Acceptance Testing of FUN3D for Entry Descent and Landing Applications

    Get PDF
    The functional equivalence of the unstructured grid code FUN3D to the the structured grid code LAURA (Langley Aerothermodynamic Upwind Relaxation Algorithm) is documented for applications of interest to the Entry, Descent, and Landing (EDL) community. Examples from an existing suite of regression tests are used to demonstrate the functional equivalence, encompassing various thermochemical models and vehicle configurations. Algorithm modifications required for the node-based unstructured grid code (FUN3D) to reproduce functionality of the cell-centered structured code (LAURA) are also documented. Challenges associated with computation on tetrahedral grids versus computation on structured-grid derived hexahedral systems are discussed

    Properties of Submillimeter Galaxies in a Semi-analytic Model using the "Count Matching" Approach: Application to the ECDF-S

    Get PDF
    We present a new technique for modeling submillimeter galaxies (SMGs): the "Count Matching" approach. Using lightcones drawn from a semi-analytic model of galaxy formation, we choose physical galaxy properties given by the model as proxies for their submillimeter luminosities, assuming a monotonic relationship. As recent interferometric observations of the Extended Chandra Deep Field South show that the brightest sources detected by single-dish telescopes are comprised by emission from multiple fainter sources, we assign the submillimeter fluxes so that the combined LABOCA plus bright-end ALMA observed number counts for this field are reproduced. After turning the model catalogs given by the proxies into submillimeter maps, we perform a source extraction to include the effects of the observational process on the recovered counts and galaxy properties. We find that for all proxies, there are lines of sight giving counts consistent with those derived from LABOCA observations, even for input sources with randomized positions in the simulated map. Comparing the recovered redshift, stellar mass and host halo mass distributions for model SMGs with observational data, we find that the best among the proposed proxies is that in which the submillimeter luminosity increases monotonically with the product between dust mass and SFR. This proxy naturally reproduces a positive trend between SFR and bolometric IR luminosity. The majority of components of blended sources are spatially unassociated.Comment: 21 pages, 20 figures, 5 tables. Accepted for publication in MNRA

    Connectivity between white shark populations off Central California, USA and Guadalupe Island, Mexico

    Get PDF
    Marine animals often move beyond national borders and exclusive economic zones resulting in a need for trans-boundary management spanning multiple national jurisdictions. Highly migratory fish vulnerable to over-exploitation require protections at international level, as exploitation practices can be disparate between adjacent countries and marine jurisdictions. In this study we collaboratively conducted an analysis of white shark connectivity between two main aggregation regions with independent population assessment and legal protection programs; one off central California, USA and one off Guadalupe Island, Mexico. We acoustically tagged 326 sub-adult and adult white sharks in central California (n=210) and in Guadalupe Island (n=116) with acoustic transmitters between 2008-2019. Of the 326 tagged white sharks, 30 (9.20%) individuals were detected at both regions during the study period. We used a Bayesian implementation of logistic regression with a binomial distribution to estimate the effect of sex, maturity, and tag location to the response variable of probability of moving from one region to the other. While nearly one in ten individuals in our sample were detected in both regions over the study period, the annual rate of trans-regional movement was low (probability of movement = 0.015 yr-1, 95% credible interval = 0.002, 0.061). Sub-adults were more likely than adults to move between regions and sharks were more likely to move from Guadalupe Island to central California, however, sex, and year were not important factors influencing movement. This first estimation of demographic-specific trans-regional movement connecting US and Mexico aggregations with high seasonal site fidelity represents an important step to future international management and assessment of the northeastern Pacific white shark population as a whole
    • …
    corecore